Maximum likelihood multiple subspace projections for hidden Markov models

نویسنده

  • Mark J. F. Gales
چکیده

The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some complex pattern recognition tasks the choice of a good feature space may vary depending on the signal content. An example is in speech recognition where phone dependent feature subspaces may be useful. Handling multiple subspaces while still maintaining meaningful likelihood comparisons between classes is a key issue. This paper describes two new forms of multiple subspace schemes. For both schemes, the problem of handling likelihood consistency between the various subspaces is dealt with by viewing the projection schemes within a maximum likelihood framework. Efficient estimation formulae for the model parameters for both schemes are derived. In addition, the computational cost for their use during recognition are given. These new projection schemes are evaluated on a large vocabulary speech recognition task in terms of performance, speed of likelihood calculation and number of model parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic volatility in mean models with heavy-tailed distributions: A maximum likelihood approach using structured hidden Markov models

In this article, we introduce a likelihood-based estimation method for the stochastic volatility in mean (SVM) model with scale mixtures of normal (SMN) distributions (Abanto-Valle et al., 2012). Our estimation method is based on the fact that the powerful hidden Markov model (HMM) machinery can be applied in order to evaluate an arbitrarily accurate approximation of the likelihood of an SVM mo...

متن کامل

Maximum-likelihood estimation for hidden Markov models

Hidden Markov models assume a sequence of random variables to be conditionally independent given a sequence of state variables which forms a Markov chain. Maximum-likelihood estimation for these models can be performed using the EM algorithm. In this paper the consistency of a sequence of maximum-likelihood estimators is proved. Also, the conclusion of the Shannon-McMillan-Breiman theorem on en...

متن کامل

Optimal linear feature transformations for semi-continuous hidden Markov models

Linear discriminant or Karhunen-Lo eve transforms are established techniques for mapping features into a lower dimensional subspace. This paper introduces a uniform statistical framework, where the computation of the optimal feature reduction is formalized as a Maximum-Likelihood estimation problem. The experimental evaluation of this suggested extension of linear selection methods shows a slig...

متن کامل

On Bahadur Efficiency of the Maximum Likelihood Estimator in Hidden Markov Models

In this paper, we study large deviations of maximum likelihood and related estimators for hidden Markov models. A hidden Markov model consists of parameterized Markov chains in a Markovian random environment, with the underlying environmental Markov chain viewed as missing data. A difficulty with parameter estimation in this model is the non-additivity of the log-likelihood function. Based on a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Speech and Audio Processing

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2002